1 Probabilistic Real - Time Dataaccess with Deadline Andinterval
نویسندگان
چکیده
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملProbabilistic Real-Time Data Access with Interval Constraints
Real-time data management for manufacturing control applications indicates a need for probabilistic deadline guarantees and interval constraints. When shared data objects are treated as resources, real-time data management becomes a resourceconstrained real-time scheduling problem. In this paper, we perform simulations and measurements to evaluate the utilities of existing real-time scheduling ...
متن کاملQoS guarantee using probabilistic deadlines
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task instance will complete its execution before its absolute deadline (hard guarantee), our approach permits to estimate the probability that it will happen. Such a statistical guarantee is performed based on interarrival and ...
متن کاملDeadline dependent coding-a framework for wireless real-time communication
A framework for real-time communication over a wireless channel is proposed. The concept of deadline dependent coding (DDC), previously suggested by the authors, is further developed using soft decision decoding of block codes to maximize the probability of delivering information before a given deadline. The strategy of DDC is to combine different coding and decoding methods with automatic repe...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997